Decision Support System for Open Vehicle Routing With Transhipments and Stopovers
نویسندگان
چکیده
Corresponding Author: Naragain Phumchusri Department of Industrial Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand Email: [email protected] Abstract: Transshipments and stopovers are considered to be an effective method to reduce traveling distance where a transportation job can be served by two vehicles: One picks up a load and drops it at a transshipment point and then another vehicle carries that load to the final delivery place. The goal of this study is to develop a decision support system for open vehicle routing with transshipments and stopovers. We propose a heuristic to find transshipments and stopovers opportunities from an initial routing. Decision methods consist of four main processes: (1) Searching jobs that allow transshipment opportunity, (2) searching paths that allow transshipment opportunity, (3) matching paths and (4) selecting jobs to create new paths with transshipment. The output is the improved routing with transshipments and stopovers, resulting lower total costs. From computational experiments, our proposed method could reduce the system’s total cost up to 12.42 percent as compared to the typical routing without transshipments and stopovers. We design system database and user interfaces, considering all input requirement entering and result displays that are easily used, so that the system can be effectively applied in actual working environments.
منابع مشابه
A Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version
Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...
متن کاملA Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملA Vehicle Routing Problem with Inventory in a Hybrid Uncertain Environment
Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints – which is known as the Vehicle Routing Problem (VRP) – delivering new items, and resolving the invent...
متن کاملA HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM
The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...
متن کاملA green vehicle routing problem with customer satisfaction criteria
This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCS
دوره 11 شماره
صفحات -
تاریخ انتشار 2015